Shortest path problem

Results: 829



#Item
111Graph theory / Mathematics / Network theory / Edsger W. Dijkstra / Shortest path problem / Matching / Topological sorting / Matrix / Graph

Efficient and Effective Matching of Image Sequences Under Substantial Appearance Changes Exploiting GPS Priors Olga Vysotska Tayyab Naseer

Add to Reading List

Source URL: europa2.informatik.uni-freiburg.de

Language: English - Date: 2015-09-26 10:11:08
112Operations research / Ant colony optimization algorithms / Edsger W. Dijkstra / Travelling salesman problem / Swarm intelligence / Mathematical optimization / Shortest path problem / Heuristic / Algorithm

Improvement of a car racing controller by means of Ant Colony Optimization algorithms Luis delaOssa, Jos´e A. G´amez and Ver´onica L´opez Abstract— The performance of a car racing controller depends on many factors

Add to Reading List

Source URL: www.csse.uwa.edu.au

Language: English - Date: 2009-02-05 01:17:35
113Physics / Thermodynamics / Mathematics / Equilibrium chemistry / Thermodynamic equilibrium / Nash equilibrium / Non-equilibrium thermodynamics / Shortest path problem / Physical chemistry

Errata (May 12, 2006; July 22, 2009) for HARD-TO-SOLVE BIMATRIX GAMES B Y R AHUL S AVANI AND B ERNHARD VON S TENGEL Econometrica), 397–429. The second-to-last paragraph on page 410 should read:

Add to Reading List

Source URL: www.maths.lse.ac.uk

Language: English - Date: 2009-07-30 17:45:21
114Graph theory / Mathematics / Discrete mathematics / Network theory / Edsger W. Dijkstra / Networks / Flow network / Operations research / Directed graph / Price of anarchy / Shortest path problem / Routing

Equilibrium Flows and Path Dilation for a Network Forwarding Game 137 Equilibrium Flows and Path Dilation for a Network Forwarding Game George Karakostas1, Anastasios Viglas2

Add to Reading List

Source URL: www.cas.mcmaster.ca

Language: English - Date: 2014-12-11 18:56:43
115Graph theory / Mathematics / Combinatorial optimization / Edsger W. Dijkstra / Routing algorithms / Search algorithms / NP-complete problems / Graph traversal / Shortest path problem / Matching / A* search algorithm / Planar graph

Lower and Upper Competitive Bounds for Online Directed Graph ExplorationI Klaus-Tycho Foerstera,1,∗, Roger Wattenhofera a ETH Z¨

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2016-02-08 07:16:33
116Mathematics / Combinatorial optimization / Graph theory / Routing algorithms / Edsger W. Dijkstra / Search algorithms / Game artificial intelligence / A* search algorithm / Shortest path problem / Connectivity / Matching / Tree

IEEE ROBOTICS AND AUTOMATION LETTERS. PREPRINT VERSION. DECEMBER, Lazy Data Association For Image Sequences Matching Under Substantial Appearance Changes

Add to Reading List

Source URL: europa2.informatik.uni-freiburg.de

Language: English - Date: 2016-03-17 16:23:23
117Graph theory / Mathematics / Computational complexity theory / Spanning tree / NP-complete problems / Dominating set / Minimum spanning tree / Maximal independent set / Matching / Travelling salesman problem / Shortest path problem / Tree

Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma †

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:16:16
118Mathematics / Graph theory / Computational complexity theory / Combinatorial optimization / Submodular set function / Edsger W. Dijkstra / NP-complete problems / Algorithm / Shortest path problem / HeldKarp algorithm / Dominating set

Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ † Research Center for Information Technology Innova

Add to Reading List

Source URL: nms.citi.sinica.edu.tw

Language: English - Date: 2013-02-26 21:19:15
119Graph theory / Mathematics / Network theory / Discrete mathematics / Network analysis / Networks / Algebraic graph theory / Centrality / Betweenness centrality / Closeness centrality / Social network analysis / Shortest path problem

Practical Issues and Algorithms for Analyzing Terrorist Networks1 Tami Carpenter, George Karakostas, and David Shallcross Telcordia Technologies 445 South Street Morristown, NJKeywords: social network analysis, ce

Add to Reading List

Source URL: www.cas.mcmaster.ca

Language: English - Date: 2002-08-28 20:49:00
120Indoor positioning system / Automatic identification and data capture / Ubiquitous computing / Robot navigation / Edsger W. Dijkstra / Robotic mapping / Radio-frequency identification / Simultaneous localization and mapping / Shortest path problem / Occupancy grid mapping

RFID-Based Hybrid Metric-Topological SLAM for GPS-denied Environments Christian Forster1 , Deon Sabatta2,3 , Roland Siegwart2 , Davide Scaramuzza1 Abstract— In this work, we propose a novel RFID-based hybrid metric-top

Add to Reading List

Source URL: rpg.ifi.uzh.ch

Language: English - Date: 2013-11-17 14:26:59
UPDATE